Guarding disjoint triangles and claws in the plane
نویسندگان
چکیده
منابع مشابه
Vertex-disjoint t-claws in graphs
Let δ(G) denote the minimum degree of a graph G. We prove that for t ≥ 4 and k ≥ 2, a graph G of order at least (t + 1)k + 11 6 t 2 with δ(G) ≥ k + t − 1 contains k pairwise vertex-disjoint copies of K1,t.
متن کاملThe Vertex-Disjoint Triangles Problem
The vertex-disjoint triangles (VDT) problem asks for a set of maximum number of pairwise vertex-disjoint triangles in a given graph G. The triangle cover problem asks for the existence of a perfect triangle packing in a graph G. It is known that the triangle cover problem is NPcomplete on general graphs with clique number 3 [6]. The VDT problem is MAX SNP-hard on graphs with maximum degree four...
متن کاملForbidden Pairs for Vertex-Disjoint Claws
Let k ≥ 4, and let H1, H2 be connected graphs with |V (Hi)| ≥ 3 for i = 1, 2. A graph G is said to be {H1, . . . , Hl}-free if none of H1, . . . , Hl is an induced subgraph of G. We prove that if there exists a positive integer n0 such that every {H1, H2}-free graph G with |V (G)| ≥ n0 and δ(G) ≥ 3 contains k vertex-disjoint claws, then {H1, H2} ∩ {K1,t | t ≥ 2} = ∅. Also, we prove that every K...
متن کاملDisjoint Color-Avoiding Triangles
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be the maximum integer so that in every edge coloring of Kn with r colors, there is a set of fr(n) pairwise edge-disjoint triangles that is r-color avoiding. We prove that 0.1177n2(1 − o(1)) < f2(n) < 0.1424n2(1 + o(1)). T...
متن کاملDisjoint triangles and pentagons in a graph
Let n, s, and t be integers with s ≥ 1, t ≥ 0, and n = 3s + 5t. Let G be a graph of order n such that the minimum degree of G is at least (n + s + t)/2. Then G contains s + t independent subgraphs such that s of them are triangles and t of them are pentagons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2003
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(02)00130-x